Cryptanalysis of Boolean permutation-based key escrow scheme
نویسنده
چکیده
Wu and Varadharajan [Computers and Electrical Engineering 25(4) 1999] proposed a fast public key escrow scheme. The security of this system is based on a special class of trapdoor Boolean permutations that can be constructed efficiently. In this paper, we show that this proposed class of Boolean permutations can be easily inverted without the knowledge of the secret key parameters. This allows the cryptanlyst to efficiently recover the session key using the known public key parameters. 2009 Elsevier Ltd. All rights reserved.
منابع مشابه
Cryptanalysis of Wang et al's Certificateless Signature Scheme without Bilinear Pairings
In these years, the design of certificateless signature (CLS) scheme without bilinear pairings has been thoroughly investigated owing to its effectiveness on solving the key escrow problem in identity-based cryptography. In this paper, we identify that Wang et al.’s certificateless signature scheme cannot fulfil its security claims. We present a series of attack processes to demonstrate that Wa...
متن کاملCube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
In this paper, we comprehensively study the resistance of keyed variants of SHA-3 (Keccak) against algebraic attacks. This analysis covers a wide range of key recovery, MAC forgery and other types of attacks, breaking up to 9 rounds (out of the full 24) of the Keccak internal permutation much faster than exhaustive search. Moreover, some of our attacks on the 6-round Keccak are completely pract...
متن کاملArtemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملCryptanalysis of a Certificateless Ring Signcryption Scheme
Certificateless public key cryptography (CL-PKC) is an appealing paradigm with the advantages of both conventional public key cryptosystem and ID-based cryptosystem because it avoids using certificates and eliminates the key escrow problem. Ring signcryption is an attractive primitive which allows one user to send a message anonymously, confidentially and authentically. Recently, Qi et al. prop...
متن کاملCryptanalysis of a Certificateless Signature Scheme without Bilinear Pairings
During these years, the research field of certificateless signature (CLS) scheme without bilinear pairings is promptly investigated as the key escrow problem in identity-based cryptography can be solved via such concept. In this paper, we demonstrate that a certificateless signature scheme proposed by Gong and Li cannot fulfill its security claims. The authors argued that their proposed certifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Electrical Engineering
دوره 36 شماره
صفحات -
تاریخ انتشار 2010